(1, -1)-MATRICES WITH NEAR-EXTREMAL PROPERTIESDE LAUNEY, Warwick; LEVIN, David A.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 3, pp 1422-1440, issn 0895-4801, 19 p.Article

A probabilistic approach to the dichotomy problemLUCZAK, Tomasz; NESETRIL, Jaroslav.SIAM journal on computing (Print). 2007, Vol 36, Num 3, pp 835-843, issn 0097-5397, 9 p.Article

LIMIT BEHAVIOR OF LOCALLY CONSISTENT CONSTRAINT SATISFACTION PROBLEMSBODIRSKY, Manuel; KRAL, Daniel.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 916-933, issn 0895-4801, 18 p.Article

ALMOST ALL C₄-FREE GRAPHS HAVE FEWER THAN (1 ― ε) ex(n, C₄) EDGESBALOGH, Jozsef; SAMOTIJ, Wojciech.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1011-1018, issn 0895-4801, 8 p.Article

A QUANTITATIVE VERSION OF THE GIBBARD-SATTERTHWAITE THEOREM FOR THREE ALTERNATIVES : Foundation of Computer ScienceFRIEDGUT, Ehud; KALAI, Gil; KELLER, Nathan et al.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 934-952, issn 0097-5397, 19 p.Article

HOW MANY POINTS CAN BE RECONSTRUCTED FROM κ PROJECTIONS?MATOUSEK, Jiří; PRIVETIVY, Aleš; SKOVRON, Petr et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1605-1623, issn 0895-4801, 19 p.Article

BOUNDS ON EDGE COLORINGS WITH RESTRICTIONS ON THE UNION OF COLOR CLASSESARAVIND, N. R; SUBRAMANIAN, C. R.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 841-852, issn 0895-4801, 12 p.Article

UNIVERSALITY OF THE LIMIT SHAPE OF CONVEX LATTICE POLYGONAL LINESBOGACHEV, Leonid V; ZARBALIEV, Sakhavat M.Annals of probability. 2011, Vol 39, Num 6, pp 2271-2317, issn 0091-1798, 47 p.Article

The asymptotic value of the Randić index for treesXUELIANG LI; YIYANG LI.Advances in applied mathematics (Print). 2011, Vol 47, Num 2, pp 365-378, issn 0196-8858, 14 p.Article

RAMSEY-TYPE PROBLEM FOR AN ALMOST MONOCHROMATIC K₄FOX, Jacob; SUDAKOV, Benny.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 155-162, issn 0895-4801, 8 p.Article

The multicovering radius problem for some types of discrete structuresAW, Alan J.Designs, codes and cryptography. 2014, Vol 72, Num 2, pp 195-209, issn 0925-1022, 15 p.Article

RAMSEY NUMBERS AND THE SIZE OF GRAPHSSUDAKOV, Benny.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 4, pp 980-986, issn 0895-4801, 7 p.Article

Density of constant radius normal binary covering codesELLIS, Robert B.Discrete mathematics. 2008, Vol 308, Num 19, pp 4446-4459, issn 0012-365X, 14 p.Conference Paper

A note on the size-Ramsey number of long subdivisions of graphsDONADELLI, Jair; HAXELL, Penny E; KOHAYAKAWA, Yoshiharu et al.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 1, pp 191-206, issn 0988-3754, 16 p.Article

Positive association in the fractional fuzzy potts modelKAHN, Jeff; WEININGER, Nicholas.Annals of probability. 2007, Vol 35, Num 6, pp 2038-2043, issn 0091-1798, 6 p.Article